A weighted k-nearest neighbor density estimate for geometric inference
نویسندگان
چکیده
منابع مشابه
A Weighted k-Nearest Neighbor Density Estimate for Geometric Inference
Abstract Motivated by a broad range of potential applications in topological and geometric inference, we introduce a weighted version of the knearest neighbor density estimate. Various pointwise consistency results of this estimate are established. We present a general central limit theorem under the lightest possible conditions. In addition, a strong approximation result is obtained and the ch...
متن کاملNeighbor-weighted K-nearest neighbor for unbalanced text corpus
Text categorization or classification is the automated assigning of text documents to pre-defined classes based on their contents. Many of classification algorithms usually assume that the training examples are evenly distributed among different classes. However, unbalanced data sets often appear in many practical applications. In order to deal with uneven text sets, we propose the neighbor-wei...
متن کاملA Novel Weighted Voting for K-Nearest Neighbor Rule
K-nearest neighbor rule (KNN) is the wellknown non-parametric technique in the statistical pattern classification, owing to its simplicity, intuitiveness and effectiveness. In this paper, we firstly review the related works in brief and detailedly analyze the sensitivity issue on the choice of the neighborhood size k, existed in the KNN rule. Motivated by the problem, a novel dual weighted voti...
متن کاملWeighted k-Nearest-Neighbor Techniques for High Throughput Screening Data
The k-nearest neighbors (knn) is a simple but effective method of classification. In this paper we present an extended version of this technique for chemical compounds used in High Throughput Screening, where the distances of the nearest neighbors can be taken into account. Our algorithm uses kernel weight functions as guidance for the process of defining activity in screening data. Proposed ke...
متن کاملA New Distance-weighted k-nearest Neighbor Classifier
In this paper, we develop a novel Distance-weighted k -nearest Neighbor rule (DWKNN), using the dual distance-weighted function. The proposed DWKNN is motivated by the sensitivity problem of the selection of the neighborhood size k that exists in k -nearest Neighbor rule (KNN), with the aim of improving classification performance. The experiment results on twelve real data sets demonstrate that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Statistics
سال: 2011
ISSN: 1935-7524
DOI: 10.1214/11-ejs606